(K,L)-eigenvectors in max-min algebra
نویسندگان
چکیده
Using the concept of (K,L)-eigenvector, we investigate structure max-min eigenspace associated with a given eigenvalue matrix in algebra (also known as fuzzy algebra). In our approach, is split into several regions according to order relations between and components x. The resulting theory (K,L)-eigenvectors, being based on fundamental results Gondran Minoux, allows describe whole explicitly more detail.
منابع مشابه
Monotone interval eigenproblem in max-min algebra
Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library The interval eigenpr...
متن کاملEigenvectors of interval matrices over max-plus algebra
The behaviour of a discrete event dynamic system is often conveniently described using a matrix algebra with operations max and plus Such a system moves forward in regular steps of length equal to the eigenvalue of the system matrix if it is set to operation at time instants corresponding to one of its eigenvectors However due to imprecise measurements it is often unappropriate to use exact mat...
متن کاملIteration algorithm for solving Ax = b in max–min algebra
For solving the linear system A x = b we introduce some iteration algorithms, where A = (aij) and b = bi a given matrix and a column vector with elements from a Brouwerian lattice, and is a max–min composite operation. 2005 Elsevier Inc. All rights reserved.
متن کاملDynamic Min-Max Problems
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t cou...
متن کاملMin - Max Heaps
,4 simple implementation of doubleended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2021
ISSN: ['1872-6801', '0165-0114']
DOI: https://doi.org/10.1016/j.fss.2020.07.008